parser generators - определение. Что такое parser generators
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое parser generators - определение

PROGRAM THAT GENERATES PARSERS OR COMPILERS FROM SOURCE FILES
Parser generator; Parser generators; Compiler compiler; Compiler Compiler; Compiler generator; Semantic action routine; Compiler development tools; Metacompiler; Parser compiler
Найдено результатов: 110
parser generator         
A program which takes a formal description of a grammar (e.g. in BNF) and outputs source code for a parser which will recognise valid strings obeying that grammar and perform associated actions. Unix's yacc is a well known example.
Compiler-Compiler         
An early compiler generator for the Atlas, with its own distinctive input language. ["The Compiler-Compiler", R.A. Brooker et al, Ann Rev Automatic Programming 3:229-275, Pergamon 1963]. (1994-10-24)
compiler-compiler         
A utility to generate the source code of a parser, interpreter or compiler from an annotated language description (usually in BNF). Most so called compiler-compilers are really just parser generators. Examples are Bison, Eli, FSL, META 5, MUG2, Parsley, Pre-cc, Yacc. (1995-01-23)
compiler compiler         
Compiler-compiler         
In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine.
Simple LR parser         
TYPE OF LR PARSER WITH SMALL PARSE TABLES AND A RELATIVELY SIMPLE PARSER GENERATOR ALGORITHM
SLR parser; SLR(1)
In computer science, a Simple LR or SLR parser is a type of LR parser with small parse tables and a relatively simple parser generator algorithm. As with other types of LR(1) parser, an SLR parser is quite efficient at finding the single correct bottom-up parse in a single left-to-right scan over the input stream, without guesswork or backtracking.
LALR parser generator         
PROGRAM THAT GENERATES LALR PARSERS OR COMPILERS FROM SOURCE FILES
A lookahead LR parser (LALR) generator is a software tool that reads a BNF grammar and creates an LALR parser which is capable of parsing files written in the computer language defined by the BNF grammar. LALR parsers are desirable because they are very fast and small in comparison to other types of parsers.
Parser combinator         
Parser combinators; Combinatory parsing; Parser Combinator; Combinator parser; Parser Combinators
In computer programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting strings as input and returning some structure as output, typically a parse tree or a set of indices representing locations in the string where parsing stopped successfully.
Chemical graph generator         
  • '''Breadth-first search generation.''' Molecular structure generation is explained step by step. Starting from a set of atoms, bonds are added between atom pairs until reaching saturated structures.
  • '''Graph representation of the [[serotonin]] molecule.''' '''(A)''' Molecular structure of serotonin. '''(B)''' Graph representation of the molecule.
  • '''Overlapping substructures of caffeine.''' Two substructures of a caffeine molecule are given, '''(A)''' and '''(B)'''. The overlap of these substructures is highlighted in green in the caffeine structure '''(C)'''.
SOFTWARE USED IN CHEMINFORMATICS
User:Daniel Mietchen/Chemical graph generators; Chemical graph generators
A chemical graph generator is a software package to generate computer representations of chemical structures adhering to certain boundary conditions. The development of such software packages is a research topic of cheminformatics.
Earley parser         
AN ALGORITHM FOR PARSING STRINGS THAT BELONG TO A GIVEN CONTEXT-FREE LANGUAGE
Earley Parser; Early algorithm; Earley Algorithm; Early Parser; Earley algorithm; Early parser; Early Algorithm; Earley's algorithm; Earley parsing; Parse forest
In computer science, the Earley parser is an algorithm for parsing strings that belong to a given context-free language, though (depending on the variant) it may suffer problems with certain nullable grammars. The algorithm, named after its inventor, Jay Earley, is a chart parser that uses dynamic programming; it is mainly used for parsing in computational linguistics.

Википедия

Compiler-compiler

In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of formal description of a programming language and machine.

The most common type of compiler-compiler is more precisely called a parser generator. It only handles syntactic analysis.

The input of a parser generator is a grammar file, typically written in Backus–Naur form (BNF) or extended Backus–Naur form (EBNF) that defines the syntax of a target programming language.

The output is the source code of a parser for the programming language. The output of the (compiled) parser source code is a parser. It may be either standalone or embedded. This parser takes as an input the source code of the target programming language source and performs some action or outputs an abstract syntax tree (AST).

Parser generators do not handle the semantics of the AST, or the generation of machine code for the target machine.

A metacompiler is a software development tool used mainly in the construction of compilers, translators, and interpreters for other programming languages. The input to a metacompiler is a computer program written in a specialized programming metalanguage designed mainly for the purpose of constructing compilers. The language of the compiler produced is called the object language. The minimal input producing a compiler is a metaprogram specifying the object language grammar and semantic transformations into an object program.